منابع مشابه
Time-Constrained Graph Pattern Matching in a Large Temporal Graph
Graph pattern matching(GPM) is an important operation on graph computation. Most existing work assumes that query graph or data graph is static, which is contrary to the fact that graphs in real life are intrinsically dynamic. Therefore, in this paper, we propose a new problem of Time-Constrained Graph Pattern Matching(TCGPM) in a large temporal graph. Different from traditional work, our work ...
متن کاملGraph Searching with Advice
Fraigniaud et al. (2006) introduced a new measure of difficulty for a distributed task in a network. The smallest number of bits of advice of a distributed problem is the smallest number of bits of information that has to be available to nodes in order to accomplish the task efficiently. Our paper deals with the number of bits of advice required to perform efficiently the graph searching proble...
متن کاملConnected graph searching
In the graph searching game the opponents are a set of searchers and a fugitive in a graph. The searchers try to capture the fugitive by applying some sequence of moves that include placement, removal, or sliding of a searcher along an edge. The fugitive tries to avoid capture by moving along unguarded paths. The search number of a graph is the minimum number of searchers required to guarantee ...
متن کاملGraph Searching & Perfect Graphs ∗
Perfect graphs, by definition, have a nice structure, that graph searching seems to extract in a, often non-inexpensive, manner. We scratch the surface of this elegant research area by giving two examples: Lexicographic Breadth Search on Chordal Graphs, and Lexicographic Depth First Search on Cocomparability graphs.
متن کاملMonotonicity in Graph Searching
We give a new proof of the result, due to A. LaPaugh, that a graph may be optimally " searched " without clearing any edge twice. o 19~~ Academic PWS, IIIC. Let us regard a graph as a system of tunnels containing a (lucky, invisible, fast) fugitive. We desire to capture this fugitive by " searching " all edges of the graph, in a sequence of discrete steps, while using the fewest possible " guar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.02.035